High Performance Routing in a LEO Satellite Network

نویسندگان

  • Roy Kucukates
  • Cem Ersoy
چکیده

Satellite systems are designed as a backup system to the existing land based wireless systems. Because of the global coverage of the system it becomes more economic for the rural areas where there is no wired infrastructure of communication. Besides being more economic to the rural areas the satellite networks are not affected by the natural disasters and continue to give the service in such situations. In this research a routing method in a routing set concept is investigated. The system tries to minimize the maximum flow over a given set of shortest paths from the source to destination and aims to leave additional capacity over the inter-satellite links to be able to utilize better the limited capacity and, also, to avoid the congestion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Routing Algorithm for Mpls Traffic Engineering in Leo Satellite Constellation Network

With regard to the limited link time of the inter-satellite links in LEO satellite constellation network, this paper proposes a routing algorithm which takes the limited link time into account, and supports traffic engineering. The routing algorithm is based on MPLS satellite network. The initial weight of links is defined to be function of residual bandwidth and link time. And during the weigh...

متن کامل

Performance Comparison of Optimal Routing and Dynamic Routing on Low-earth Orbit Satellite Networks

We compare the performances of two diierent routing schemes for LEO satellite networks through simulation. The rst one is a dynamic routing scheme based on the shortest-path algorithm. Its routing table is updated according to cost estimation based on link status information that is broadcasted periodically. The second one is an optimal routing scheme proposed by the authors of this paper, wher...

متن کامل

A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algorithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adaptive routing (DT-TTAR) algorithm is proposed in this paper. This routing a...

متن کامل

A Load-Balanced On-Demand Routing for LEO Satellite Networks

Due to population distribution and economic flourish diversity, the low earth orbit (LEO) satellite network carries unbalanced traffic load, which leads that parts of satellite links are congested while others are underutilized. Furthermore, the congested inter-satellite links result in high queuing delay and packet dropping ratio. To ensure an intelligent scheduling of traffic over entire sate...

متن کامل

Distributed on-demand routing for LEO satellite systems

Notwithstanding the limited commercial success of the first narrowband Low Earth Orbit (LEO) satellite systems, the interest of the scientific community in this type of systems has been revived on the basis of the current trend toward the migration to all IP-based services. LEO systems can play a pivotal role in providing services to areas where there is no substantial terrestrial infrastructur...

متن کامل

Fsa-based Link Assignment and Routing in Low-earth Orbit Satellite Networks

| We propose a new framework for the link assignment (i.e., topological design) problem that arises from the use of inter-satellite links (ISL's) in Low-Earth Orbit (LEO) satellite networks. In the proposed framework, we model a LEO satellite network as a Finite State Automaton (FSA) where each state corresponds to an equal-length interval in the system period of the LEO satellite network. This...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003